class Solution:
    def minTimeToVisitAllPoints(self, points: List[List[int]]) -> int:
        sum=0
        for i in range(len(points)-1):
            a=abs(points[i][0]-points[i+1][0])
            b=abs(points[i][1]-points[i+1][1])
            sum+=max(a,b)
        return sum